Scattered packings of cycles
نویسندگان
چکیده
منابع مشابه
Scattered packings of cycles
We consider the problem Scattered Cycles which, given a graph G and two positive integers r and `, asks whether G contains a collection of r cycles that are pairwise at distance at least `. This problem generalizes the problem Disjoint Cycles which corresponds to the case ` = 1. We prove that when parameterized by r, `, and the maximum degree ∆, the problem Scattered Cycles admits a kernel on 2...
متن کاملMaximum packings of the complete graph with uniform length cycles
In this paper we find the maximum number of pairwise edge-disjoint mcycles which exist in a complete graph with n vertices, for all values of n and m with 3 ≤ m ≤ n.
متن کاملAlmost Resolvable Maximum Packings of Complete Graphs with 4-Cycles
If the complete graph Kn has vertex set X , a maximum packing of Kn with 4-cycles, (X,C, L), is an edge-disjoint decomposition of Kn into a collection C of 4-cycles so that the unused edges (the set L) is as small a set as possible. Maximum packings of Kn with 4-cycles were shown to exist by Schönheim and Bialostocki (Can. Math. Bull. 18:703–708, 1975). An almost parallel class of a maximum pac...
متن کاملOptimal Packings of Hamilton Cycles in Sparse Random Graphs
We prove that there exists a positive constant ε such that if log n/n ≤ p ≤ n−1+ε, then asymptotically almost surely the random graph G ∼ G(n, p) contains a collection of bδ(G)/2c edge-disjoint Hamilton cycles.
متن کاملMatchings, Hamilton cycles and cycle packings in uniform hypergraphs
It is well known that every bipartite graph with vertex classes of size nwhose minimum degree is at least n/2 contains a perfect matching. We prove an analogue of this result for uniform hypergraphs. We also provide an analogue of Dirac’s theorem on Hamilton cycles for 3-uniform hypergraphs: We say that a 3-uniform hypergraph has a Hamilton cycle if there is a cyclic ordering of its vertices su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.07.021